POJ-1511 Invitation Cards（双向单源最短路 Dijstra+heap or SPFA）

发表于 | 更新于: | 分类于 ， | | 阅读次数: |
字数统计: 942 | 阅读时长 ≈ 6

描述

传送门：POJ-1511 Invitation Cards

In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They have printed invitation cards with all the necessary information and with the programme. A lot of students were hired to distribute these invitations among the people. Each student volunteer has assigned exactly one bus stop and he or she stays there the whole day and gives invitation to people travelling by bus. A special course was taken where students learned how to influence people and what is the difference between influencing and robbery.

The transport system is very special: all lines are unidirectional and connect exactly two stops. Buses leave the originating stop with passangers each half an hour. After reaching the destination stop they return empty to the originating stop, where they wait until the next full half an hour, e.g. X:00 or X:30, where ‘X’ denotes the hour. The fee for transport between two stops is given by special tables and is payable on the spot. The lines are planned in such a way, that each round trip (i.e. a journey starting and finishing at the same stop) passes through a Central Checkpoint Stop (CCS) where each passenger has to pass a thorough check including body scan.

All the ACM student members leave the CCS each morning. Each volunteer is to move to one predetermined stop to invite passengers. There are as many volunteers as stops. At the end of the day, all students travel back to CCS. You are to write a computer program that helps ACM to minimize the amount of money to pay every day for the transport of their employees.

输入描述

The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case begins with a line containing exactly two integers P and Q, 1 <= P,Q <= 1000000. P is the number of stops including CCS and Q the number of bus lines. Then there are Q lines, each describing one bus line. Each of the lines contains exactly three numbers - the originating stop, the destination stop and the price. The CCS is designated by number 1. Prices are positive integers the sum of which is smaller than 1000000000. You can also assume it is always possible to get from any stop to any other stop.

输出描述

For each case, print one line containing the minimum amount of money to be paid each day by ACM for the travel costs of its volunteers.

示例

输入

1
2
3
4
5
6
7
8
9
10
11
2
2 2
1 2 13
2 1 33
4 6
1 2 10
2 1 60
1 3 20
3 4 10
2 4 5
4 1 50

输出

1
2
46
210

题解

题目大意

给定一个有向图，求一个点到所有点的最短距离之和加上所有点到这个点距离之和。
图中的节点个数范围：0～1e6;

思路

建图时反向建边，先做一次Dijkstra，然后将所有的边反序做一次Dijkstra即可，Dijkstra必须是heap优化的。
SPFA同理，先做一次spfa，然后将所有的边反序做一次spfa即可。

代码

Dijkstra
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<iostream>
#include<cstdio>
#include<cstring>
#include<functional>
#include<vector>
#include<queue>
using namespace std;
typedef long long LL;
typedef pair<int,int> p;
const int N = 1e6+5, int INF = 0x3f3f3f3f;
struct edge{
    int to,cost;
};

vector<edge>eg[N];
int V,E;
bool used[N];
int d[N];
int a[N],b[N],c[N];

void dijkstra(int s){
    for(int i=1;i<=V;i++){
        d[i]=INF;
    }
    priority_queue<p,vector<p>,greater<p> > que;
    d[1] = 0;
    que.push(p(d[1], 1));
    while(!que.empty()){
        int now = que.top().second;
        que.pop();
        for(int i = 0; i < eg[now].size(); i++){
            int v = eg[now][i].to;
            if(d[v] > d[now] + eg[now][i].cost){
                d[v] = d[now] + eg[now][i].cost;
                que.push(p(d[v], v));
            }
        }
    }
}

int main(){
    int q;
    scanf("%d",&q);
    while(q--){
        scanf("%d %d",&V,&E);
        for(int i=1;i<=V;i++){
            eg[i].clear();
        }
        for(int i=1;i<=E;i++){
            scanf("%d%d%d",&a[i],&b[i],&c[i]);
            edge gg;
            gg.to=b[i],gg.cost=c[i];
            eg[a[i]].push_back(gg);
        }
        dijkstra(1);
        LL sum=0;
        for(int i=1;i<=V;i++){
            sum+=d[i];
        }
        for(int i=1;i<=V;i++){
            eg[i].clear();
        }
        for(int i=1;i<=E;i++){
            edge gg;
            gg.to=a[i],gg.cost=c[i];
            eg[b[i]].push_back(gg);
        }
        dijkstra(1);
        for(int i=1;i<=V;i++){
            sum+=d[i];
        }
        printf("%lld\n",sum);
    }
}